Weakly True Concurrency and Its Logic
نویسنده
چکیده
We firstly find the existence of silent event τ in true concurrency (named weakly true concurrency) by defining weakly true concurrent behaviors and weakly true concurrent logics. Based on Paolo Baldan and Silvia Crafa’s comprehensive work on (strongly) true concurrency, we find the correspondence between weakly true concurrent equivalences and weakly true concurrent logics.
منابع مشابه
A Calculus for True Concurrency
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...
متن کاملConcurrency with partial information
The aim of this paper is to introduce a new formalism for multi-agent systems that captures (true) concurrency and independence. We begin describing a complete and decidable propositional multi-modal logic. The language, similar to Propositional Dynamic Logic in many aspects, di ers from usual modal logic: modal operators are non-atomic (they are built out of basic actions) and capture concurre...
متن کاملConcurrency and local reasoning under reverse exchange
Quite a number of aspects of concurrency are reflected by the inequational exchange law (P ∗Q) ; (R ∗S) ≤ (P ;R)∗(Q ;S) between sequential composition ; and concurrent composition ∗. In particular, recent research has shown that, under a certain semantic definition, validity of this law is equivalent to that of the familiar concurrency rule for Hoare triples. Unfortunately, while the law holds ...
متن کاملA Sequent Calculus for Modelling Interferences
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal with multisequent structures and has the cut-elimination property. Extensions are proposed that give first results concerning our objectives.
متن کاملOracle Semantics for Concurrent Separation Logic (preliminary version)
We define in Coq with machine-checked proofs a modular operational semantics for Concurrent C minor, a language with shared memory, spawnable threads, and firstclass locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and dataflow constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.06422 شماره
صفحات -
تاریخ انتشار 2016